A Graph-Based, Metric Space Proximity Calculator for Internet Objects
نویسندگان
چکیده
RÉSUMÉ. Les méthodes permettant de mesurer la proximité dans un espace métrique ont trouvé de nouvelles applications récentes avec la recherche sur Internet. Nous présentons ici une nouvelle approche pour la recherche sur Internet. Nous utilisons une combinaison des mesures de distance dans un espace métrique et l’analyse des liens pour définir la proximité des objets sur Internet. Cette structure est générique et elle peut être applique à plusieurs domaines comme la gestion de la relation client, les ressources humaines, ou les systèmes de informatiques géographiques Nous donnons un exemple dans la domaine de la fouille de texte. Nous donnons aussi le fondement mathématique de notre méthode ainsi qu’un exemple détaillé suivi d’une présentation de nos résultats.
منابع مشابه
Best Proximity Point Result for New Type of Contractions in Metric Spaces with a Graph
In this paper, we introduce a new type of graph contraction using a special class of functions and give a best proximity point theorem for this contraction in complete metric spaces endowed with a graph under two different conditions. We then support our main theorem by a non-trivial example and give some consequences of best proximity point of it for usual graphs.
متن کاملBest proximity point theorems in 1/2−modular metric spaces
In this paper, first we introduce the notion of $frac{1}{2}$-modular metric spaces and weak $(alpha,Theta)$-$omega$-contractions in this spaces and we establish some results of best proximity points. Finally, as consequences of these theorems, we derive best proximity point theorems in modular metric spaces endowed with a graph and in partially ordered metric spaces. We present an ex...
متن کاملNew best proximity point results in G-metric space
Best approximation results provide an approximate solution to the fixed point equation $Tx=x$, when the non-self mapping $T$ has no fixed point. In particular, a well-known best approximation theorem, due to Fan cite{5}, asserts that if $K$ is a nonempty compact convex subset of a Hausdorff locally convex topological vector space $E$ and $T:Krightarrow E$ is a continuous mapping, then there exi...
متن کاملNon-Archimedean fuzzy metric spaces and Best proximity point theorems
In this paper, we introduce some new classes of proximal contraction mappings and establish best proximity point theorems for such kinds of mappings in a non-Archimedean fuzzy metric space. As consequences of these results, we deduce certain new best proximity and fixed point theorems in partially ordered non-Archimedean fuzzy metric spaces. Moreover, we present an example to illustrate the us...
متن کاملUsing the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where proximity is defined in terms of a distance function. A solution for this problem consists in building an offline index to quickly satisfy online queries. The ultimate goal is to use as few distance computations as p...
متن کامل